Rho-Calculi for Computation and Logic
نویسندگان
چکیده
The rho-calculi provide enlightening concepts for both computing and reasoning as well as their combination. They consist in the generalization of lambda-calculus to structures like terms, propositions or graphs and we will show how their interrelations with deduction provide powerful frameworks for the next generation of proof assistants. 1998 ACM Subject Classification F.4.1 Mathematical Logic – Lambda calculus and related systems, I.2.3 Deduction and Theorem Proving, F.4.2 Grammars and Other Rewriting Systems
منابع مشابه
Decidable Type Inference for the Polymorphic Rewriting Calculus
A promising line of research unifying the logic paradigm with the functional paradigm is that of rewrite-based languages [MOM02] like, for example, ELAN [The04d], Maude [The04c], ASF+SDF [The04a], Obj∗ [FN96, Gog04]). This kind of languages have been successfully used for theorem proving [BCM04], constraint solving [Cas96], model-checking [EMS03, CMR04], program transformation [vdBKV96], etc. M...
متن کاملObservational Mu-Calculus
We propose an extended modal mu-calculus to provide an ‘assembly language’ for modal logics for real time, value-passing calculi, and other extended models of computation.
متن کاملOptimal intelligent control for glucose regulation
This paper introduces a novel control methodology based on fuzzy controller for a glucose-insulin regulatory system of type I diabetes patient. First, in order to incorporate knowledge about patient treatment, a fuzzy logic controller is employed for regulating the gains of the basis Proportional-Integral (PI) as a self-tuning controller. Then, to overcome the key drawback of fuzzy logic contro...
متن کاملLeftmost Outside - In Narrowing Calculi 1
We present narrowing calculi that are computation models of functional-logic programming languages. The narrowing calculi are based on the notion of the leftmost outside-in reduction of Huet and Lévy. We note the correspondence between the narrowing and reduction derivations, and define the leftmost outside-in narrowing derivation. We then give a narrowing calculus OINC that generates the leftm...
متن کاملExpressing Mobile Ambients in Temporal Logic of Actions
text Temporal logic of actions is a logic for specifying and reasoning about concurrent systems, developed mainly for verification. Ambient calculus is a formalism for describing mobility and distributed computation. We express mobile ambients in temporal logic of actions, provide some results and illustrate the description through examples. Finally we give an implementation of mobile ambients ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012